freely generated group

См. также в других словарях:

• Free group — In mathematics, a group G is called free if there is a subset S of G such that any element of G can be written in one and only one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st 1 =… …   Wikipedia

• Generating set of a group — In abstract algebra, a generating set of a group is a subset that is not contained in any proper subgroup of the group. Equivalently, a generating set of a group is a subset such that every element of the group can be expressed as the combination …   Wikipedia

• SQ universal group — In mathematics, in the realm of group theory, a countable group is said to be SQ universal if every countable group can be embedded in one of its quotient groups. SQ universality can be thought of as a measure of largeness or complexity of a… …   Wikipedia

• Frobenius group — In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non trivial elementfixes more than one point and some non trivial element fixes a point. They are named after F. G. Frobenius. Structure The… …   Wikipedia

• Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia

• Dehn function — In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a relation in that group (that is a freely reduced word in the …   Wikipedia

• Grushko theorem — In the mathematical subject of group theory, the Grushko theorem or the Grushko Neumann theorem is a theorem stating that the rank (that is, the smallest cardinality of a generating set) of a free product of two groups is equal to the sum of the… …   Wikipedia

• Rips machine — In geometric group theory, the Rips machine is a method of studying the action of groups on R trees. It was introduced in unpublished work of Eliyahu Rips in about 1991. An R tree is a uniquely arcwise connected metric space in which every arc is …   Wikipedia

• Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most …   Wikipedia

• Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …   Wikipedia

• Hopf invariant — In mathematics, in particular in algebraic topology, the Hopf invariant is a homotopy invariant of certain maps between spheres. toc Motivation In 1931 Heinz Hopf used Clifford parallels to construct the Hopf map etacolon S^3 o S^2, and proved… …   Wikipedia